Basic comparison of Modes for Authenticated - Encryption ( IAPM , XCBC , OCB , CCM , EAX , CWC , GCM , PCFB , CS )
نویسنده
چکیده
An authentication-encryption (AE) scheme is an encryption scheme with a pre-shared key providing both data privacy and authenticity. Basic AE scheme can be constructed by a naive (serial) combination of some existing encryption mode together with a message authentication code (MAC). The computation cost of such approach equals to cost of the encryption plus the cost of the MAC. There are several reasons why to design a dedicated mode. An improper combination of encryption and authentication mode can make whole scheme insecure. A random nonce (initialization vector) is often required, what is hard to achieve. Random and secret value of the nonce serves as “native” integrity protection of the nonce value and thus preventing predictable changes to a plaintext by attacker. A data encryption modes or MAC calculations are often not parallelizable and thus unsuitable for a high-speed environments.
منابع مشابه
Authenticated Encryption Modes of Block Ciphers, Their Security and Implementation Properties
In this thesis, four authenticated encryption modes of operation are presented, namely, GCM mode, CCM* mode, OCB mode and CWC mode. These modes can provide confidentiality and authenticity simultaneously. The GCM mode and CCM* mode are in detail introduced. And it shows the comparison of the four modes from different aspects: properties, security, and performance in hardware implementation and ...
متن کاملThe Software Performance of Authenticated-Encryption Modes
We study the software performance of authenticated-encryption modes CCM, GCM, and OCB. Across a variety of platforms, we find OCB to be substantially faster than either alternative. For example, on an Intel i5 (“Clarkdale”) processor, good implementations of CCM, GCM, and OCB encrypt at around 4.2 cpb, 3.7 cpb, and 1.5 cpb, while CTR mode requires about 1.3 cpb. Still we find room for algorithm...
متن کاملReforgeability of Authenticated Encryption Schemes
This work pursues the idea of multi-forgery attacks as introduced by Ferguson in 2002. We recoin reforgeability for the complexity of obtaining further forgeries once a first forgery has succeeded. First, we introduce a security notion for the integrity (in terms of reforgeability) of authenticated encryption schemes: j-Int-CTXT, which is derived from the notion INT-CTXT. Second, we define an a...
متن کاملPractical Fault Attacks on Authenticated Encryption Modes for AES
Since the first demonstration of fault attacks by Boneh et al. on RSA, a multitude of fault attack techniques on various cryptosystems have been proposed. Most of these techniques, like Differential Fault Analysis, Safe Error Attack, and Collision Fault Analysis have the requirement to process two inputs that are either identical or related, in order to generate pairs of correct/faulty cipherte...
متن کاملStatistical Fault Attacks on Nonce-Based Authenticated Encryption Schemes
Since the first demonstration of fault attacks by Boneh et al. on RSA, a multitude of fault attack techniques on various cryptosystems have been proposed. Most of these techniques, like Differential Fault Analysis, Safe Error Attack, and Collision Fault Analysis have the requirement to process two inputs that are either identical or related, in order to generate pairs of correct/faulty cipherte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004